In article <39b8cf06$1@news.povray.org>, Warp <war### [at] tagpovrayorg> 
wrote:

>   A list is rather simple, but it's not unusual at all that you make 
> mistakes easily (memory leaks, reading freed memory...).

My first version of the new glow patch being an embarassing example of 
this...


>   A weighted binary tree IS NOT easy at all to do. You have to code quite 
> a lot to get one done. Why should I do it when it's already done. And 
> done well.

Because I want to know how to do it? And because I don't want to be 
separated from what my program is doing? And because when I was *trying* 
to learn the STL, I often got errors and couldn't figure out why?

-- 
Christopher James Huff
Personal: chr### [at] maccom, http://homepage.mac.com/chrishuff/
TAG: chr### [at] tagpovrayorg, http://tag.povray.org/

<><

Post a reply to this message